Title Quantum - Inspired Boolean States for Bounding Engineering Network Reliability
نویسندگان
چکیده
Significant methodological progress has taken place to quantify the reliability of networked systems over the past decades. Both numerical and analytical methods have enjoyed improvements via a host of advanced Monte Carlo simulation strategies, state space partition methods, statistical learning, and Boolean functions among others. The latter approach exploits logic to approximate network reliability assessments efficiently while offering theoretical error guarantees. In parallel, physicists have made progress modeling complex systems via tensor networks (TNs), particularly quantum many-body systems. Inspired by the representation power of quantum TNs, this paper offers a new approach to efficiently bound network reliability (REL) classically. It does so by exactly solving a related network Boolean satisfiability counting problem (or #SATNET ), represented as a TN, which upper-bounds general all-terminal reliability (ATR) problems by counting configurations in which all network nodes are connected to at least a neighbor. Our #SATNET counting outperforms state-of-the-art approximate counters for the same problem as shown for challenging two-dimensional lattice networks of increasing size. While the over-counting from #SATNET increases exponentially relative to the number of configurations that satisfy (ATR) or #RELAT , the bias is predictable for ideal networks, such as lattices, and the upper-bound is guaranteed with 100% confidence—a desirable feature when other methods with error guarantees fail to scale. Clearly, our goal is not to solve the general stochastic network reliability problem, which remains a #P problem in the computational complexity hierarchy (i.e., a counting version of non-deterministic polynomial time [NP ] problems ∗Associate Professor, Department of Civil and Environmental Engineering, Rice University, Houston, Texas. Email: [email protected] †Professor, Department of Computer Science, Rice University, Houston, Texas. E-mail: [email protected] ‡Professor, Department of Statistics, Oregon State University. E-mail: [email protected]
منابع مشابه
BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملMonte Carlo Simulation to Compare Markovian and Neural Network Models for Reliability Assessment in Multiple AGV Manufacturing System
We compare two approaches for a Markovian model in flexible manufacturing systems (FMSs) using Monte Carlo simulation. The model which is a development of Fazlollahtabar and Saidi-Mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (AGV) namely, the reliability of machines and the reliability of AGVs in a multiple AGV jobsho...
متن کاملVector space weightless neural networks
By embedding the boolean space Z2 as an orthonormal basis in a vector space we can treat the RAM based neuron as a matrix (operator) acting on the vector space. We show how this model (inspired by our research on quantum neural networks) is of sufficient generality as to have classical weighted (perceptronlike), classical weightless (RAM-based, PLN, etc), quantum weighted and quantum weightless...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017